#ifndef SIMPLE_SP_H
#define SIMPLE_SP_H

#include "levenshtein.h"

#include <string>
#include <vector>

typedef std::vector<std::string> SimpleDictionary;

std::string FindTheNearest(const SimpleDictionary& dictionary, const std::string& word);

template <class Iterator>
void LoadDictionary(Iterator begin, Iterator end, SimpleDictionary* dictionary)
{
    for (Iterator it = begin; it != end; ++it)
    {
        dictionary->push_back(*it);
    }
}

#endif //SIMPLE_SP_H
